An abstract machine for concurrent modular systems: CHARM
نویسندگان
چکیده
منابع مشابه
An Abstract Machine for Concurrent Modular Systems: CHARM
Corradini, A., U. Montanari and F. Rossi, An abstract machine for concurrent modular systems: CHARM, Theoretical Computer Science 122 (1994) 165-200. CHARM (for concurrency and hiding in an abstract rewriting machine) is an abstract machine which allows one to model naturally the behavior of distributed systems consisting of a collection of processes-sharing variables. CHARM is equipped with a ...
متن کاملAn Abstract Concurrent Machine for Rewriting
1 I n t r o d u c t i o n Term rewriting is a powerful computat ional paradigm. On the one hand, it has the full power of Turing machines, because they can be formulated as rewrite systems, and on the other hand, i t lends itself to parallel execution, since different subterms of a term can be rewrit ten concurrently. A rewrite rule over a set of (first-order) terms is an ordered pair of terms,...
متن کاملAn abstract machine for concurrent haskell with futures
We show how Sestoft’s abstract machine for lazy evaluation of purely functional programs can be extended to evaluate expressions of the calculus CHF – a process calculus that models Concurrent Haskell extended by imperative and implicit futures. The abstract machine is modularly constructed by first adding monadic IO-actions to the machine and then in a second step we add concurrency. Our main ...
متن کاملdevelopment and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولAbstract Modular Systems and Solvers
Modular Systems and Solvers Yuliya Lierler and Miroslaw Truszczynski 1 University of Nebraska at Omaha [email protected] 2 University of Kentucky
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90206-2